Another Enumeration of Constellations
نویسنده
چکیده
منابع مشابه
Asymptotic Enumeration of Constellations and Related Families of Maps on Orientable Surfaces
We perform the asymptotic enumeration of two classes of rooted maps on orientable surfaces:m-hypermaps andm-constellations. Form = 2 they correspond respectively to maps with even face degrees and bipartite maps. We obtain explicit asymptotic formulas for the number of such maps with any finite set of allowed face degrees. Our proofs combine a bijective approach, generating series techniques re...
متن کاملEnumeration of planar constellations
The enumeration of transitive ordered factorizations of a given permutation is a combinatorial problem related to singularity theory. Let n > 1, m > 2, and let 0 be a permutation of Sn having di cycles of length i, for i > 1. We prove that the number of m-tuples (1 ; : : : ; m) of permutations of Sn such that: A one-to-one correspondence relates these m-tuples to some rooted planar maps, which ...
متن کاملPerformance of Transmission control Protocol Congestioncontrol Algorithms on Teledesic satellites constellations
Satellite networking is different from wired or wireless networks. TCP/IP performance and behavior with respect to normal wireless network and wired networks are different from one another. As the architecture of TCP/IP protocol was not designed to perform well over high-latency or noisy channels and so its performance over satellite networks are totally different. The properties of satellite c...
متن کاملSolving Bus Terminal Location Problem Using Simulated Annealing Method
Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...
متن کاملSolving Bus Terminal Location Problem Using Simulated Annealing Method
Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007